Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
نویسندگان
چکیده
Abstract The shortest path problem (SPP) is a special network structured linear programming that appears in wide range of applications. Classical SPPs consider only one objective the networks while some or all multiple, conflicting and incommensurate objectives such as optimization cost, profit, time, distance, risk, quality service may arise together real-world These types are known multi-objective (MOSPP) can be solved with existing various approaches. This paper develops Data Envelopment Analysis (DEA)-based approach to solve MOSPP fuzzy parameters (FMOSPP) account for real situations where input–output data include uncertainty triangular membership form. make connection between DEA more flexible deal practical To this end, each arc FMOSPP considered decision-making unit multiple inputs outputs. Then two efficiency scores obtained corresponding arc. combined define unique relative efficiency. Hence, converted into single Fuzzy Shortest Path Problem (FSPP) using FSPP algorithms.
منابع مشابه
fuzzy dynamic multi-objective data envelopment analysis model (fdm-dea)
data envelopment analysis (dea) is a managerial powerful tool for assess the performance of decision making units (dmus). nowadays, multi-objective dea models are an attractive technique for evaluation quantity and quality aspects of performance analysis. but these models are in static. in this paper, we want to present a proposed fuzzy dynamic multi-objective dea model in which data are changi...
متن کاملA new approach based on alpha cuts for solving data envelopment analysis model with fuzzy stochastic inputs and outputs
Data Envelopment Analysis (DEA) is a widely used technique for measuring the relative efficiencies of homogenous Decision Making Units (DMUs) with multiple inputs and multiple outputs. These factors may be evaluated in fuzzy or stochastic environment. Hence, the classic structures of DEA model may be changed where in two fold fuzzy stochastic environment. For instances, linearity, feasibility a...
متن کاملOn Solving the Quadratic Shortest Path Problem
The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order m + 1, where m is the number of arcs in the graph. We use the alternating direction method of...
متن کاملSolving Multi-Objective Fuzzy Solid Transportation Problem Based On Expected Value And The Goal Programming Approach
In the present paper, the multi-objective solid transportation problem with fuzzy coefficients for the objectives and constraints is modelled and then solved. Fuzzy goal programming is used to the linear multiobjective solid transportation problem, and an optimal compromise solution is obtained. Firstly, expected values of the fuzzy objective functions are considered to derive crisp values. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2021
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-020-00234-4